module.exports = function (e) {
    var t = {};
    function i(n) {
        if (t[n])
            return t[n].exports;
        var a = t[n] = {
            i: n,
            l: false,
            exports: {}
        };
        e[n].call(a.exports, a, a.exports, i);
        a.l = true;
        return a.exports;
    }
    i.m = e;
    i.c = t;
    i.d = function (e, t, n) {
        i.o(e, t) || Object.defineProperty(e, t, {
            enumerable: true,
            get: n
        });
    };
    i.r = function (e) {
        'undefined' != typeof Symbol && Symbol.toStringTag && Object.defineProperty(e, Symbol.toStringTag, { value: 'Module' });
        Object.defineProperty(e, '__esModule', { value: true });
    };
    i.t = function (e, t) {
        1 & t && (e = i(e));
        if (8 & t)
            return e;
        if (4 & t && 'object' == typeof e && e && e.__esModule)
            return e;
        var n = Object.create(null);
        i.r(n);
        Object.defineProperty(n, 'default', {
            enumerable: true,
            value: e
        });
        if (2 & t && 'string' != typeof e)
            for (var a in e)
                i.d(n, a, function (t) {
                    return e[t];
                }.bind(null, a));
        return n;
    };
    i.n = function (e) {
        var t = e && e.__esModule ? function () {
            return e.default;
        } : function () {
            return e;
        };
        i.d(t, 'a', t);
        return t;
    };
    i.o = function (e, t) {
        return Object.prototype.hasOwnProperty.call(e, t);
    };
    i.p = '';
    return i(i.s = 0);
}([
    function (e, t, i) {
        'use strict';
        function n(e, t, i) {
            return f.llparser_create(e, t, i);
        }
        function a(e) {
            f.llparser_destroy(e);
        }
        function r(e, t) {
            return f.llparser_create_descriptor(e, t);
        }
        function o(e) {
            f.llparser_descriptor_set_all(e);
        }
        function s(e) {
            f.llparser_descriptor_set_nil(e);
        }
        function l(e, t) {
            f.llparser_descriptor_add_char(e, t);
        }
        function d(e, t, i) {
            f.llparser_descriptor_add_range(e, t, i);
        }
        function A(e) {
            f.llparser_descriptor_revert(e);
        }
        function c(e, t, i, n, a, r, o, s, l, d, A, c) {
            return f.llparser_add_rule(e, t, i, n, a, r, o, s, l, d, A, c);
        }
        function h(e) {
            f.llparser_prepare(e);
        }
        function u(e, t) {
            return f.llparser_parse(e, t);
        }
        function p(e) {
            return f.llparser_get_input_buffer(e);
        }
        function g(e) {
            return f.llparser_get_result(e);
        }
        function _() {
            f.wasm_main();
        }
        i.r(t);
        i.d(t, 'llparser_create', function () {
            return n;
        });
        i.d(t, 'llparser_destroy', function () {
            return a;
        });
        i.d(t, 'llparser_create_descriptor', function () {
            return r;
        });
        i.d(t, 'llparser_descriptor_set_all', function () {
            return o;
        });
        i.d(t, 'llparser_descriptor_set_nil', function () {
            return s;
        });
        i.d(t, 'llparser_descriptor_add_char', function () {
            return l;
        });
        i.d(t, 'llparser_descriptor_add_range', function () {
            return d;
        });
        i.d(t, 'llparser_descriptor_revert', function () {
            return A;
        });
        i.d(t, 'llparser_add_rule', function () {
            return c;
        });
        i.d(t, 'llparser_prepare', function () {
            return h;
        });
        i.d(t, 'llparser_parse', function () {
            return u;
        });
        i.d(t, 'llparser_get_input_buffer', function () {
            return p;
        });
        i.d(t, 'llparser_get_result', function () {
            return g;
        });
        i.d(t, 'wasm_main', function () {
            return _;
        });
        i.d(t, 'memory', function () {
            return v;
        });
        var f = i(1);
        var v = f.memory;
        f.__wbindgen_start();
    },
    function (e, t, i) {
        'use strict';
        i.r(t);
        i.d(t, 'memory', function () {
            return r;
        });
        i.d(t, 'rust_calloc', function () {
            return o;
        });
        i.d(t, 'rust_free', function () {
            return s;
        });
        i.d(t, 'llparser_create', function () {
            return l;
        });
        i.d(t, 'llparser_destroy', function () {
            return d;
        });
        i.d(t, 'llparser_create_descriptor', function () {
            return A;
        });
        i.d(t, 'llparser_descriptor_set_all', function () {
            return c;
        });
        i.d(t, 'llparser_descriptor_set_nil', function () {
            return h;
        });
        i.d(t, 'llparser_descriptor_add_char', function () {
            return u;
        });
        i.d(t, 'llparser_descriptor_add_range', function () {
            return p;
        });
        i.d(t, 'llparser_descriptor_revert', function () {
            return g;
        });
        i.d(t, 'llparser_add_rule', function () {
            return _;
        });
        i.d(t, 'llparser_prepare', function () {
            return f;
        });
        i.d(t, 'llparser_parse', function () {
            return v;
        });
        i.d(t, 'llparser_get_input_buffer', function () {
            return w;
        });
        i.d(t, 'llparser_get_result', function () {
            return m;
        });
        i.d(t, 'wasm_main', function () {
            return I;
        });
        i.d(t, '__wbindgen_start', function () {
            return b;
        });
        var n = new ArrayBuffer(1114112);
        var a = function (e, t, i) {
            var n = new e.Int8Array(i);
            new e.Int16Array(i);
            var a = new e.Int32Array(i);
            var r = new e.Uint8Array(i);
            var o = new e.Uint16Array(i);
            var s = new e.Uint32Array(i);
            new e.Float32Array(i);
            new e.Float64Array(i);
            var l = e.Math.imul;
            e.Math.fround;
            e.Math.abs;
            var d = e.Math.clz32;
            e.Math.min;
            e.Math.max;
            e.Math.floor;
            e.Math.ceil;
            e.Math.sqrt;
            e.NaN;
            e.Infinity;
            var A = 1048576;
            function c(e) {
                var t = 0;
                var i = 0;
                var n = 0;
                var r = 0;
                var o = 0;
                var s = 0;
                var l = 0;
                i = (t = e + -8 | 0) + (e = -8 & (r = a[e + -4 >> 2])) | 0;
                e: {
                    t: {
                        i: {
                            n: {
                                a:
                                    if (!(1 & r)) {
                                        if (!(3 & r))
                                            break n;
                                        e = (r = a[t >> 2]) + e | 0;
                                        if ((0 | (t = t - r | 0)) == a[262246]) {
                                            if (3 != (3 & a[i + 4 >> 2]))
                                                break a;
                                            a[262244] = e;
                                            a[i + 4 >> 2] = -2 & a[i + 4 >> 2];
                                            a[t + 4 >> 2] = 1 | e;
                                            a[e + t >> 2] = e;
                                            return;
                                        }
                                        if (r >>> 0 >= 256) {
                                            _(t);
                                        } else {
                                            if ((0 | (n = a[t + 8 >> 2])) == (0 | (o = a[t + 12 >> 2]))) {
                                                s = 1048576;
                                                l = a[262144] & m(r >>> 3);
                                                a[s >> 2] = l;
                                            } else {
                                                a[n + 12 >> 2] = o;
                                                a[o + 8 >> 2] = n;
                                            }
                                        }
                                    }
                                if (2 & (r = a[i + 4 >> 2])) {
                                    a[i + 4 >> 2] = -2 & r;
                                    a[t + 4 >> 2] = 1 | e;
                                    a[e + t >> 2] = e;
                                } else {
                                    a: {
                                        if (a[262247] != (0 | i)) {
                                            if ((0 | i) != a[262246])
                                                break a;
                                            a[262246] = t;
                                            e = a[262244] + e | 0;
                                            a[262244] = e;
                                            a[t + 4 >> 2] = 1 | e;
                                            a[e + t >> 2] = e;
                                            return;
                                        }
                                        a[262247] = t;
                                        e = a[262245] + e | 0;
                                        a[262245] = e;
                                        a[t + 4 >> 2] = 1 | e;
                                        if ((0 | t) == a[262246]) {
                                            a[262244] = 0;
                                            a[262246] = 0;
                                        };
                                        if ((i = a[262254]) >>> 0 >= e >>> 0)
                                            break n;
                                        if (!(e = a[262247]))
                                            break n;
                                        r:
                                            if (!((r = a[262245]) >>> 0 < 41))
                                                for (t = 1049000;;) {
                                                    if ((n = a[t >> 2]) + a[t + 4 >> 2] >>> 0 > e >>> 0 && n >>> 0 <= e >>> 0)
                                                        break r;
                                                    if (!(t = a[t + 8 >> 2]))
                                                        break;
                                                }
                                        n = 4095;
                                        if (e = a[262252]) {
                                            for (t = 0; t = t + 1 | 0, e = a[e + 8 >> 2];);
                                            n = t >>> 0 > 4095 ? t : 4095;
                                        }
                                        a[262256] = n;
                                        if (r >>> 0 <= i >>> 0)
                                            break n;
                                        a[262254] = -1;
                                        return;
                                    }
                                    e = (n = -8 & r) + e | 0;
                                    if (n >>> 0 >= 256) {
                                        _(i);
                                    } else {
                                        if ((0 | (n = a[i + 12 >> 2])) == (0 | (i = a[i + 8 >> 2]))) {
                                            s = 1048576;
                                            l = a[262144] & m(r >>> 3);
                                            a[s >> 2] = l;
                                        } else {
                                            a[i + 12 >> 2] = n;
                                            a[n + 8 >> 2] = i;
                                        }
                                    }
                                    a[t + 4 >> 2] = 1 | e;
                                    a[e + t >> 2] = e;
                                    if (a[262246] == (0 | t)) {
                                        a[262244] = e;
                                        break n;
                                    }
                                }
                                if (e >>> 0 < 256)
                                    break i;
                                g(t, e);
                                e = a[262256] + -1 | 0;
                                a[262256] = e;
                                if (!e) {
                                    if (e = a[262252])
                                        break t;
                                    e = 4095;
                                    break e;
                                }
                            }
                            return;
                        }
                        e = 1048584 + ((i = e >>> 3) << 3) | 0;
                        r = a[262144];
                        i = 1 << (31 & i);
                        n = a[e + 8 >> 2];
                        if (!(r & i)) {
                            a[262144] = i | r;
                            n = e;
                        };
                        i = n;
                        a[e + 8 >> 2] = t;
                        a[i + 12 >> 2] = t;
                        a[t + 12 >> 2] = e;
                        a[t + 8 >> 2] = i;
                        return;
                    }
                    for (t = 0; t = t + 1 | 0, e = a[e + 8 >> 2];);
                    e = t >>> 0 > 4095 ? t : 4095;
                }
                a[262256] = e;
            }
            function h(e, t, i, n, r, o, s, d, c, h, u, p) {
                var g;
                A = g = A + -64 | 0;
                a[g + 60 >> 2] = e;
                a[g + 56 >> 2] = t;
                a[g + 52 >> 2] = i;
                a[g + 48 >> 2] = n;
                a[g + 44 >> 2] = r;
                a[g + 40 >> 2] = o;
                a[g + 36 >> 2] = s;
                a[g + 32 >> 2] = d;
                a[g + 28 >> 2] = c;
                a[g + 24 >> 2] = h;
                a[g + 20 >> 2] = u;
                a[g + 16 >> 2] = p;
                t = a[a[g + 60 >> 2] + 28 >> 2];
                i = a[g + 60 >> 2];
                e = a[i >> 2];
                a[i >> 2] = e + 1;
                a[g + 12 >> 2] = t + l(e, 44);
                a[a[g + 12 >> 2] >> 2] = a[g + 52 >> 2];
                a[a[g + 12 >> 2] + 4 >> 2] = a[g + 48 >> 2];
                a[g + 48 >> 2] > 0 && (a[a[g + 12 >> 2] + 8 >> 2] = a[g + 44 >> 2]);
                a[g + 48 >> 2] > 1 && (a[a[g + 12 >> 2] + 12 >> 2] = a[g + 40 >> 2]);
                a[g + 48 >> 2] > 2 && (a[a[g + 12 >> 2] + 16 >> 2] = a[g + 36 >> 2]);
                a[g + 48 >> 2] > 3 && (a[a[g + 12 >> 2] + 20 >> 2] = a[g + 32 >> 2]);
                a[g + 48 >> 2] > 4 && (a[a[g + 12 >> 2] + 24 >> 2] = a[g + 28 >> 2]);
                a[g + 48 >> 2] > 5 && (a[a[g + 12 >> 2] + 28 >> 2] = a[g + 24 >> 2]);
                a[g + 48 >> 2] > 6 && (a[a[g + 12 >> 2] + 32 >> 2] = a[g + 20 >> 2]);
                a[g + 48 >> 2] > 7 && (a[a[g + 12 >> 2] + 36 >> 2] = a[g + 16 >> 2]);
                a[a[g + 12 >> 2] + 40 >> 2] = a[g + 56 >> 2];
                a[g + 48 >> 2] > 0 && function (e, t, i) {
                    var n;
                    a[28 + (n = A - 32 | 0) >> 2] = e;
                    a[n + 24 >> 2] = t;
                    a[n + 20 >> 2] = i;
                    a[n + 16 >> 2] = (a[n + 20 >> 2] - a[a[n + 28 >> 2] + 24 >> 2] | 0) / 140;
                    1 == a[a[n + 20 >> 2] + 4 >> 2] && (t = a[a[n + 28 >> 2] + 40 >> 2], i = a[n + 28 >> 2], e = a[i + 8 >> 2], a[i + 8 >> 2] = e + 1, a[n + 12 >> 2] = t + (e << 3), a[a[n + 12 >> 2] >> 2] = a[n + 24 >> 2], a[a[n + 12 >> 2] + 4 >> 2] = a[a[n + 20 >> 2] + 136 >> 2], a[a[n + 20 >> 2] + 136 >> 2] = a[n + 12 >> 2]);
                }(a[g + 60 >> 2], a[g + 12 >> 2], a[g + 52 >> 2]);
                A = g - -64 | 0;
                return a[g + 12 >> 2];
            }
            function u(e, t, i, n, o) {
                var l;
                A = l = A - 48 | 0;
                a[l + 44 >> 2] = e;
                a[l + 40 >> 2] = t;
                a[l + 36 >> 2] = i;
                a[l + 32 >> 2] = n;
                a[l + 28 >> 2] = o;
                if (a[a[l + 40 >> 2] >> 2] != a[l + 36 >> 2])
                    for (a[a[l + 40 >> 2] >> 2] = a[l + 36 >> 2], a[l + 24 >> 2] = a[a[l + 40 >> 2] + 136 >> 2], a[l + 20 >> 2] = 1 & (0 != a[l + 28 >> 2] ^ -1 ^ -1); a[l + 24 >> 2];) {
                        a[l + 20 >> 2] || (a[l + 28 >> 2] = a[l + 24 >> 2]);
                        a[l + 16 >> 2] = a[a[a[l + 24 >> 2] >> 2] + 8 >> 2];
                        1 == a[a[l + 16 >> 2] + 4 >> 2] && u(a[l + 44 >> 2], a[l + 16 >> 2], a[l + 36 >> 2], a[l + 32 >> 2], a[l + 28 >> 2]);
                        for (a[l + 12 >> 2] = 0; !(a[l + 12 >> 2] >= 128);)
                            r[a[l + 12 >> 2] + (a[l + 16 >> 2] + 8 | 0) | 0] && (s[a[l + 28 >> 2] >> 2] >= s[a[l + 32 >> 2] + (a[l + 12 >> 2] << 2) >> 2] && a[a[l + 32 >> 2] + (a[l + 12 >> 2] << 2) >> 2] || (a[a[l + 32 >> 2] + (a[l + 12 >> 2] << 2) >> 2] = a[a[l + 28 >> 2] >> 2])), a[l + 12 >> 2] = a[l + 12 >> 2] + 1;
                        a[l + 24 >> 2] = a[a[l + 24 >> 2] + 4 >> 2];
                    }
                A = l + 48 | 0;
            }
            function p(e, t, i, n) {
                var o;
                a[44 + (o = A - 48 | 0) >> 2] = e;
                a[o + 40 >> 2] = t;
                a[o + 36 >> 2] = i;
                a[o + 32 >> 2] = n;
                for (a[o + 28 >> 2] = a[a[o + 40 >> 2] + 136 >> 2]; a[o + 28 >> 2];) {
                    a[o + 24 >> 2] = a[a[a[o + 28 >> 2] >> 2] + 8 >> 2];
                    if (a[o + 24 >> 2] == a[o + 40 >> 2])
                        for (a[o + 20 >> 2] = a[a[a[o + 28 >> 2] >> 2] + 12 >> 2], a[o + 16 >> 2] = 0; !(a[o + 16 >> 2] >= 128);) {
                            e: {
                                if (1 != a[a[o + 20 >> 2] + 4 >> 2]) {
                                    if (!r[a[o + 16 >> 2] + (a[o + 20 >> 2] + 8 | 0) | 0])
                                        break e;
                                } else if (a[o + 12 >> 2] = a[a[o + 44 >> 2] + 32 >> 2] + ((a[o + 20 >> 2] - a[a[o + 44 >> 2] + 24 >> 2] | 0) / 140 << 9), !a[a[o + 12 >> 2] + (a[o + 16 >> 2] << 2) >> 2])
                                    break e;
                                s[a[o + 28 >> 2] >> 2] >= s[a[o + 32 >> 2] + (a[o + 16 >> 2] << 2) >> 2] && a[a[o + 32 >> 2] + (a[o + 16 >> 2] << 2) >> 2] || (a[a[o + 32 >> 2] + (a[o + 16 >> 2] << 2) >> 2] = a[a[o + 28 >> 2] >> 2]);
                            }
                            a[o + 16 >> 2] = a[o + 16 >> 2] + 1;
                        }
                    a[o + 28 >> 2] = a[a[o + 28 >> 2] + 4 >> 2];
                }
            }
            function g(e, t) {
                var i = 0;
                var n = 0;
                var r = 0;
                var o = 0;
                a[e + 16 >> 2] = 0;
                a[e + 20 >> 2] = 0;
                r = e;
                i = 0;
                if (n = t >>> 8) {
                    i = 31;
                    t >>> 0 > 16777215 || (i = 62 + ((t >>> (6 - (n = d(n)) & 31) & 1) - (n << 1) | 0) | 0);
                };
                a[r + 28 >> 2] = i;
                r = 1048848 + (i << 2) | 0;
                e: {
                    t: {
                        i: {
                            n: {
                                if ((o = a[262145]) & (n = 1 << (31 & i))) {
                                    n = a[r >> 2];
                                    if ((-8 & a[n + 4 >> 2]) != (0 | t))
                                        break n;
                                    i = n;
                                    break i;
                                }
                                a[262145] = n | o;
                                a[r >> 2] = e;
                                a[e + 24 >> 2] = r;
                                break e;
                            }
                            for (r = t << (31 == (0 | i) ? 0 : 25 - (i >>> 1) & 31);;) {
                                if (!(i = a[(o = 16 + ((r >>> 29 & 4) + n | 0) | 0) >> 2]))
                                    break t;
                                r <<= 1;
                                n = i;
                                if ((-8 & a[i + 4 >> 2]) == (0 | t))
                                    break;
                            }
                        }
                        t = a[i + 8 >> 2];
                        a[t + 12 >> 2] = e;
                        a[i + 8 >> 2] = e;
                        a[e + 24 >> 2] = 0;
                        a[e + 12 >> 2] = i;
                        a[e + 8 >> 2] = t;
                        return;
                    }
                    a[o >> 2] = e;
                    a[e + 24 >> 2] = n;
                }
                a[e + 12 >> 2] = e;
                a[e + 8 >> 2] = e;
            }
            function _(e) {
                var t;
                var i = 0;
                var n = 0;
                var r = 0;
                var o = 0;
                var s = 0;
                var l = 0;
                t = a[e + 24 >> 2];
                e: {
                    t: {
                        if ((0 | e) == (0 | (i = a[e + 12 >> 2]))) {
                            r = a[(i = e + 20 | 0) >> 2];
                            if (n = a[(r ? 20 : 16) + e >> 2])
                                break t;
                            i = 0;
                            break e;
                        }
                        n = a[e + 8 >> 2];
                        a[n + 12 >> 2] = i;
                        a[i + 8 >> 2] = n;
                        break e;
                    }
                    for (r = r ? i : e + 16 | 0; o = r, (n = a[(r = (i = n) + 20 | 0) >> 2]) || (r = i + 16 | 0, n = a[i + 16 >> 2]), n;);
                    a[o >> 2] = 0;
                }
                e:
                    if (t) {
                        n = 1048848 + (a[e + 28 >> 2] << 2) | 0;
                        t: {
                            if ((0 | e) == a[n >> 2]) {
                                a[n >> 2] = i;
                                if (i)
                                    break t;
                                s = 1048580;
                                l = a[262145] & m(a[e + 28 >> 2]);
                                a[s >> 2] = l;
                                return;
                            }
                            a[(a[t + 16 >> 2] == (0 | e) ? 16 : 20) + t >> 2] = i;
                            if (!i)
                                break e;
                        }
                        a[i + 24 >> 2] = t;
                        if (n = a[e + 16 >> 2]) {
                            a[i + 16 >> 2] = n;
                            a[n + 24 >> 2] = i;
                        };
                        (e = a[e + 20 >> 2]) && (a[i + 20 >> 2] = e, a[e + 24 >> 2] = i);
                    }
            }
            function f(e, t) {
                return 0 | function (e) {
                    var t;
                    !(t = function (e) {
                        var t = 0;
                        var i = 0;
                        var n = 0;
                        var r = 0;
                        var o = 0;
                        var l = 0;
                        var A = 0;
                        var c = 0;
                        var h = 0;
                        var u = 0;
                        var p = 0;
                        e: {
                            t: {
                                i: {
                                    if (e >>> 0 >= 245) {
                                        if (e >>> 0 >= 4294901709)
                                            break t;
                                        r = -8 & (e = e + 11 | 0);
                                        if (!(c = a[262145]))
                                            break i;
                                        i = 0 - r | 0;
                                        A = 0;
                                        (e >>>= 8) && (A = 31, r >>> 0 > 16777215 || (A = 62 + ((r >>> (6 - (e = d(e)) & 31) & 1) - (e << 1) | 0) | 0));
                                        n: {
                                            a: {
                                                if (e = a[1048848 + (A << 2) >> 2]) {
                                                    for (o = r << (31 == (0 | A) ? 0 : 25 - (A >>> 1) & 31);;) {
                                                        if (!((l = -8 & a[e + 4 >> 2]) >>> 0 < r >>> 0 || (l = l - r | 0) >>> 0 >= i >>> 0 || (n = e, i = l))) {
                                                            i = 0;
                                                            break a;
                                                        }
                                                        l = a[e + 20 >> 2];
                                                        e = a[16 + ((o >>> 29 & 4) + e | 0) >> 2];
                                                        t = l && (0 | l) != (0 | e) ? l : t;
                                                        o <<= 1;
                                                        if (!e)
                                                            break;
                                                    }
                                                    if (t) {
                                                        e = t;
                                                        break a;
                                                    }
                                                    if (n)
                                                        break n;
                                                }
                                                n = 0;
                                                if (!(e = (0 - (e = 2 << (31 & A)) | e) & c))
                                                    break i;
                                                if (!(e = a[1048848 + (w(e & 0 - e) << 2) >> 2]))
                                                    break i;
                                            }
                                            for (; n = (l = (o = (t = -8 & a[e + 4 >> 2]) - r | 0) >>> 0 < i >>> 0 & t >>> 0 >= r >>> 0) ? e : n, i = l ? o : i, e = (t = a[e + 16 >> 2]) || a[e + 20 >> 2];);
                                            if (!n)
                                                break i;
                                        }
                                        if (i >>> 0 >= (e = a[262244]) - r >>> 0 && e >>> 0 >= r >>> 0)
                                            break i;
                                        _(n);
                                        n:
                                            if (i >>> 0 >= 16) {
                                                a[n + 4 >> 2] = 3 | r;
                                                a[4 + (t = n + r | 0) >> 2] = 1 | i;
                                                a[t + i >> 2] = i;
                                                if (i >>> 0 >= 256) {
                                                    g(t, i);
                                                    break n;
                                                }
                                                e = 1048584 + ((i >>>= 3) << 3) | 0;
                                                o = a[262144];
                                                i = 1 << (31 & i);
                                                A = a[e + 8 >> 2];
                                                if (!(o & i)) {
                                                    a[262144] = i | o;
                                                    A = e;
                                                };
                                                i = A;
                                                a[e + 8 >> 2] = t;
                                                a[i + 12 >> 2] = t;
                                                a[t + 12 >> 2] = e;
                                                a[t + 8 >> 2] = i;
                                            } else
                                                e = i + r | 0, a[n + 4 >> 2] = 3 | e, a[4 + (e = e + n | 0) >> 2] = 1 | a[e + 4 >> 2];
                                        return n + 8 | 0;
                                    }
                                    n: {
                                        a: {
                                            if (!(3 & (e = (t = a[262144]) >>> (n = 31 & (i = (r = e >>> 0 < 11 ? 16 : e + 11 & -8) >>> 3))))) {
                                                if (r >>> 0 <= s[262244])
                                                    break i;
                                                if (e)
                                                    break a;
                                                if (!(e = a[262145]))
                                                    break i;
                                                t = a[1048848 + (w(e & 0 - e) << 2) >> 2];
                                                i = (-8 & a[t + 4 >> 2]) - r | 0;
                                                for (o = t;;) {
                                                    if (!(e = a[t + 16 >> 2]) && !(e = a[t + 20 >> 2]))
                                                        break n;
                                                    i = (t = (n = (-8 & a[e + 4 >> 2]) - r | 0) >>> 0 < i >>> 0) ? n : i;
                                                    o = t ? e : o;
                                                    t = e;
                                                }
                                            }
                                            i = (e = a[1048592 + (l = (n = i + (1 & (-1 ^ e)) | 0) << 3) >> 2]) + 8 | 0;
                                            if ((0 | (o = a[e + 8 >> 2])) == (0 | (l = l + 1048584 | 0))) {
                                                u = 1048576;
                                                p = m(n) & t;
                                                a[u >> 2] = p;
                                            } else {
                                                a[o + 12 >> 2] = l;
                                                a[l + 8 >> 2] = o;
                                            }
                                            t = n << 3;
                                            a[e + 4 >> 2] = 3 | t;
                                            a[4 + (e = e + t | 0) >> 2] = 1 | a[e + 4 >> 2];
                                            break t;
                                        }
                                        n = w(0 - (e = (i = e << n) & (0 - (e = 2 << n) | e)) & e);
                                        e = a[1048592 + (o = n << 3) >> 2];
                                        if ((0 | (i = a[e + 8 >> 2])) == (0 | (o = o + 1048584 | 0))) {
                                            u = 1048576;
                                            p = m(n) & t;
                                            a[u >> 2] = p;
                                        } else {
                                            a[i + 12 >> 2] = o;
                                            a[o + 8 >> 2] = i;
                                        }
                                        o = e + 8 | 0;
                                        a[e + 4 >> 2] = 3 | r;
                                        i = (t = n << 3) - r | 0;
                                        a[4 + (l = e + r | 0) >> 2] = 1 | i;
                                        a[e + t >> 2] = i;
                                        if (e = a[262244]) {
                                            e = 1048584 + ((n = e >>> 3) << 3) | 0;
                                            t = a[262246];
                                            r = a[262144];
                                            n = 1 << (31 & n);
                                            A = a[e + 8 >> 2];
                                            if (!(r & n)) {
                                                a[262144] = n | r;
                                                A = e;
                                            };
                                            n = A;
                                            a[e + 8 >> 2] = t;
                                            a[n + 12 >> 2] = t;
                                            a[t + 12 >> 2] = e;
                                            a[t + 8 >> 2] = n;
                                        };
                                        a[262246] = l;
                                        a[262244] = i;
                                        return o;
                                    }
                                    _(o);
                                    if (i >>> 0 >= 16) {
                                        a[o + 4 >> 2] = 3 | r;
                                        a[4 + (l = r + o | 0) >> 2] = 1 | i;
                                        a[i + l >> 2] = i;
                                        if (e = a[262244]) {
                                            e = 1048584 + ((n = e >>> 3) << 3) | 0;
                                            t = a[262246];
                                            r = a[262144];
                                            n = 1 << (31 & n);
                                            A = a[e + 8 >> 2];
                                            if (!(r & n)) {
                                                a[262144] = n | r;
                                                A = e;
                                            };
                                            n = A;
                                            a[e + 8 >> 2] = t;
                                            a[n + 12 >> 2] = t;
                                            a[t + 12 >> 2] = e;
                                            a[t + 8 >> 2] = n;
                                        };
                                        a[262246] = l;
                                        a[262244] = i;
                                    } else {
                                        e = i + r | 0;
                                        a[o + 4 >> 2] = 3 | e;
                                        a[4 + (e = e + o | 0) >> 2] = 1 | a[e + 4 >> 2];
                                    }
                                    return o + 8 | 0;
                                }
                                i: {
                                    n: {
                                        a: {
                                            r: {
                                                if ((t = a[262244]) >>> 0 < r >>> 0) {
                                                    if ((e = a[262245]) >>> 0 > r >>> 0)
                                                        break e;
                                                    i = 0;
                                                    if (-1 == (0 | (t = I((e = r + 65583 | 0) >>> 16))))
                                                        break t;
                                                    if (!(n = t << 16))
                                                        break t;
                                                    e = (o = -65536 & e) + a[262248] | 0;
                                                    a[262248] = e;
                                                    t = a[262249];
                                                    a[262249] = t >>> 0 > e >>> 0 ? t : e;
                                                    if (!(i = a[262247]))
                                                        break r;
                                                    for (e = 1049000;;) {
                                                        if ((0 | n) == ((t = a[e >> 2]) + (l = a[e + 4 >> 2]) | 0))
                                                            break a;
                                                        if (!(e = a[e + 8 >> 2]))
                                                            break;
                                                    }
                                                    break n;
                                                }
                                                e = a[262246];
                                                if ((n = t - r | 0) >>> 0 <= 15) {
                                                    a[262246] = 0;
                                                    a[262244] = 0;
                                                    a[e + 4 >> 2] = 3 | t;
                                                    r = 4 + (t = e + t | 0) | 0;
                                                    i = 1 | a[t + 4 >> 2];
                                                } else {
                                                    a[262244] = n;
                                                    i = e + r | 0;
                                                    a[262246] = i;
                                                    a[i + 4 >> 2] = 1 | n;
                                                    a[e + t >> 2] = n;
                                                    i = 3 | r;
                                                    r = e + 4 | 0;
                                                }
                                                a[r >> 2] = i;
                                                return e + 8 | 0;
                                            }
                                            (e = a[262255]) >>> 0 <= n >>> 0 && e || (a[262255] = n);
                                            e = 0;
                                            a[262256] = 4095;
                                            a[262251] = o;
                                            a[262250] = n;
                                            for (a[262253] = 0; t = e + 1048584 | 0, a[e + 1048592 >> 2] = t, a[e + 1048596 >> 2] = t, 256 != (0 | (e = e + 8 | 0)););
                                            a[262247] = n;
                                            e = o + -40 | 0;
                                            a[262245] = e;
                                            a[n + 4 >> 2] = 1 | e;
                                            a[4 + (e + n | 0) >> 2] = 40;
                                            a[262254] = 2097152;
                                            break i;
                                        }
                                        if (!(a[e + 12 >> 2] | n >>> 0 <= i >>> 0 | t >>> 0 > i >>> 0)) {
                                            a[e + 4 >> 2] = o + l;
                                            t = (e = a[262247]) + 15 & -8;
                                            a[262247] = t + -8;
                                            i = 8 + ((n = o + a[262245] | 0) + (e - t | 0) | 0) | 0;
                                            a[262245] = i;
                                            a[t + -4 >> 2] = 1 | i;
                                            a[4 + (e + n | 0) >> 2] = 40;
                                            a[262254] = 2097152;
                                            break i;
                                        }
                                    }
                                    e = a[262255];
                                    a[262255] = e >>> 0 < n >>> 0 ? e : n;
                                    t = n + o | 0;
                                    e = 1049000;
                                    n: {
                                        for (;;) {
                                            if ((0 | t) != a[e >> 2]) {
                                                if (e = a[e + 8 >> 2])
                                                    continue;
                                                break n;
                                            }
                                            break;
                                        }
                                        if (!a[e + 12 >> 2]) {
                                            a[e >> 2] = n;
                                            a[e + 4 >> 2] = o + a[e + 4 >> 2];
                                            a[n + 4 >> 2] = 3 | r;
                                            o = n + r | 0;
                                            r = (t - n | 0) - r | 0;
                                            a: {
                                                r: {
                                                    if ((0 | t) != a[262247]) {
                                                        if (a[262246] == (0 | t))
                                                            break r;
                                                        if (1 == (3 & (e = a[t + 4 >> 2]))) {
                                                            if ((i = -8 & e) >>> 0 >= 256) {
                                                                _(t);
                                                            } else {
                                                                if ((0 | (l = a[t + 12 >> 2])) == (0 | (A = a[t + 8 >> 2]))) {
                                                                    u = 1048576;
                                                                    p = a[262144] & m(e >>> 3);
                                                                    a[u >> 2] = p;
                                                                } else {
                                                                    a[A + 12 >> 2] = l;
                                                                    a[l + 8 >> 2] = A;
                                                                }
                                                            }
                                                            r = i + r | 0;
                                                            t = t + i | 0;
                                                        };
                                                        a[t + 4 >> 2] = -2 & a[t + 4 >> 2];
                                                        a[o + 4 >> 2] = 1 | r;
                                                        a[r + o >> 2] = r;
                                                        if (r >>> 0 >= 256) {
                                                            g(o, r);
                                                            break a;
                                                        }
                                                        e = 1048584 + ((t = r >>> 3) << 3) | 0;
                                                        i = a[262144];
                                                        t = 1 << (31 & t);
                                                        A = a[e + 8 >> 2];
                                                        if (!(i & t)) {
                                                            a[262144] = t | i;
                                                            A = e;
                                                        };
                                                        i = A;
                                                        a[e + 8 >> 2] = o;
                                                        a[i + 12 >> 2] = o;
                                                        a[o + 12 >> 2] = e;
                                                        a[o + 8 >> 2] = i;
                                                        break a;
                                                    }
                                                    a[262247] = o;
                                                    e = a[262245] + r | 0;
                                                    a[262245] = e;
                                                    a[o + 4 >> 2] = 1 | e;
                                                    break a;
                                                }
                                                a[262246] = o;
                                                e = a[262244] + r | 0;
                                                a[262244] = e;
                                                a[o + 4 >> 2] = 1 | e;
                                                a[e + o >> 2] = e;
                                            }
                                            return n + 8 | 0;
                                        }
                                    }
                                    for (e = 1049000; !((t = a[e >> 2]) >>> 0 <= i >>> 0 && (l = t + a[e + 4 >> 2] | 0) >>> 0 > i >>> 0);)
                                        e = a[e + 8 >> 2];
                                    a[262247] = n;
                                    e = o + -40 | 0;
                                    a[262245] = e;
                                    a[n + 4 >> 2] = 1 | e;
                                    a[4 + (e + n | 0) >> 2] = 40;
                                    a[262254] = 2097152;
                                    a[(t = (e = (l + -32 & -8) - 8 | 0) >>> 0 < i + 16 >>> 0 ? i : e) + 4 >> 2] = 27;
                                    e = a[262250];
                                    A = a[262251];
                                    h = a[262253];
                                    a[(c = t + 16 | 0) >> 2] = a[262252];
                                    a[c + 4 >> 2] = h;
                                    a[t + 8 >> 2] = e;
                                    a[t + 12 >> 2] = A;
                                    a[262251] = o;
                                    a[262250] = n;
                                    a[262252] = t + 8;
                                    a[262253] = 0;
                                    for (e = t + 28 | 0; a[e >> 2] = 7, l >>> 0 > (e = e + 4 | 0) >>> 0;);
                                    if ((0 | t) != (0 | i)) {
                                        a[t + 4 >> 2] = -2 & a[t + 4 >> 2];
                                        e = t - i | 0;
                                        a[i + 4 >> 2] = 1 | e;
                                        a[t >> 2] = e;
                                        e >>> 0 >= 256 ? g(i, e) : (e = 1048584 + ((t = e >>> 3) << 3) | 0, n = a[262144], t = 1 << (31 & t), A = a[e + 8 >> 2], n & t || (a[262144] = t | n, A = e), t = A, a[e + 8 >> 2] = i, a[t + 12 >> 2] = i, a[i + 12 >> 2] = e, a[i + 8 >> 2] = t);
                                    };
                                }
                                i = 0;
                                if (!((e = a[262245]) >>> 0 <= r >>> 0))
                                    break e;
                            }
                            return i;
                        }
                        t = e - r | 0;
                        a[262245] = t;
                        n = (e = a[262247]) + r | 0;
                        a[262247] = n;
                        a[n + 4 >> 2] = 1 | t;
                        a[e + 4 >> 2] = 3 | r;
                        return e + 8 | 0;
                    }(e)) | !(3 & r[t + -4 | 0]) || function (e, t) {
                        if (t)
                            for (; n[0 | e] = 0, e = e + 1 | 0, t = t + -1 | 0;);
                    }(t, e);
                    return t;
                }(l(e |= 0, t |= 0));
            }
            function v() {
            }
            function w(e) {
                return e ? 31 - d(e + -1 ^ e) | 0 : 32;
            }
            function m(e) {
                var t;
                return (-1 >>> (t = 31 & e) & -2) << t | (-1 << (e = 0 - e & 31) & -2) >>> e;
            }
            function I(t) {
                t |= 0;
                var d = 0 | i.byteLength / 65536;
                var A = d + t | 0;
                if (d < A && A < 65536) {
                    var c = new ArrayBuffer(l(A, 65536));
                    var h = new e.Int8Array(c);
                    h.set(n);
                    n = h;
                    n = new e.Int8Array(c);
                    new e.Int16Array(c);
                    a = new e.Int32Array(c);
                    r = new e.Uint8Array(c);
                    o = new e.Uint16Array(c);
                    s = new e.Uint32Array(c);
                    new e.Float32Array(c);
                    new e.Float64Array(c);
                    i = c;
                }
                return d;
            }
            return {
                memory: Object.create(Object.prototype, {
                    grow: { value: I },
                    buffer: {
                        get: function () {
                            return i;
                        }
                    }
                }),
                rust_calloc: f,
                rust_free: function (e) {
                    c(e |= 0);
                },
                llparser_create: function (e, t, i) {
                    return 0 | function (e, t, i) {
                        var n;
                        var r;
                        var o;
                        A = n = A - 32 | 0;
                        a[n + 28 >> 2] = e;
                        a[n + 24 >> 2] = t;
                        a[n + 20 >> 2] = i;
                        e = n;
                        t = a[n + 28 >> 2] ? a[n + 28 >> 2] : 256;
                        a[e + 28 >> 2] = t;
                        e = n;
                        t = a[n + 24 >> 2] ? a[n + 24 >> 2] : 256;
                        a[e + 24 >> 2] = t;
                        e = n;
                        t = a[n + 20 >> 2] ? a[n + 20 >> 2] : 256;
                        a[e + 20 >> 2] = t;
                        r = n;
                        o = f(((((((l(a[n + 24 >> 2], 140) + 52 | 0) + l(a[n + 20 >> 2], 44) | 0) + (a[n + 24 >> 2] << 9) | 0) + (a[n + 24 >> 2] << 9) | 0) + l(a[n + 20 >> 2], a[n + 24 >> 2] << 3) | 0) + (a[n + 28 >> 2] << 1) | 0) + (a[n + 28 >> 2] << 3) | 0, 1);
                        a[r + 16 >> 2] = o;
                        a[a[n + 16 >> 2] + 12 >> 2] = a[n + 28 >> 2];
                        a[a[n + 16 >> 2] + 16 >> 2] = a[n + 24 >> 2];
                        a[a[n + 16 >> 2] + 20 >> 2] = a[n + 20 >> 2];
                        a[a[n + 16 >> 2] + 4 >> 2] = 0;
                        a[a[n + 16 >> 2] >> 2] = 0;
                        a[a[n + 16 >> 2] + 8 >> 2] = 0;
                        a[n + 12 >> 2] = a[n + 16 >> 2] + 52;
                        a[a[n + 16 >> 2] + 24 >> 2] = a[n + 12 >> 2];
                        a[n + 12 >> 2] = a[n + 12 >> 2] + l(a[n + 24 >> 2], 140);
                        a[a[n + 16 >> 2] + 28 >> 2] = a[n + 12 >> 2];
                        a[n + 12 >> 2] = a[n + 12 >> 2] + l(a[n + 20 >> 2], 44);
                        a[a[n + 16 >> 2] + 32 >> 2] = a[n + 12 >> 2];
                        a[n + 12 >> 2] = a[n + 12 >> 2] + (a[n + 24 >> 2] << 9);
                        a[a[n + 16 >> 2] + 36 >> 2] = a[n + 12 >> 2];
                        a[n + 12 >> 2] = a[n + 12 >> 2] + (a[n + 24 >> 2] << 9);
                        a[a[n + 16 >> 2] + 40 >> 2] = a[n + 12 >> 2];
                        a[n + 12 >> 2] = a[n + 12 >> 2] + l(a[n + 20 >> 2], a[n + 24 >> 2] << 3);
                        a[a[n + 16 >> 2] + 44 >> 2] = a[n + 12 >> 2];
                        a[n + 12 >> 2] = a[n + 12 >> 2] + (a[n + 28 >> 2] << 1);
                        a[a[n + 16 >> 2] + 48 >> 2] = a[n + 12 >> 2];
                        A = n + 32 | 0;
                        return a[n + 16 >> 2];
                    }(e |= 0, t |= 0, i |= 0);
                },
                llparser_destroy: function (e) {
                    !function (e) {
                        var t;
                        A = t = A - 16 | 0;
                        a[t + 12 >> 2] = e;
                        c(a[t + 12 >> 2]);
                        A = t + 16 | 0;
                    }(e |= 0);
                },
                llparser_create_descriptor: function (e, t) {
                    return 0 | function (e, t) {
                        var i;
                        var n;
                        a[12 + (i = A - 16 | 0) >> 2] = e;
                        a[i + 8 >> 2] = t;
                        t = a[a[i + 12 >> 2] + 24 >> 2];
                        n = a[i + 12 >> 2];
                        e = a[n + 4 >> 2];
                        a[n + 4 >> 2] = e + 1;
                        a[i + 4 >> 2] = t + l(e, 140);
                        a[a[i + 4 >> 2] + 4 >> 2] = a[i + 8 >> 2] ? 1 : 0;
                        return a[i + 4 >> 2];
                    }(e |= 0, t |= 0);
                },
                llparser_descriptor_set_all: function (e) {
                    var t;
                    e |= 0;
                    a[12 + (t = A - 16 | 0) >> 2] = e;
                    a[a[t + 12 >> 2] + 4 >> 2] = -1;
                    n[a[t + 12 >> 2] + 135 | 0] = 1;
                },
                llparser_descriptor_set_nil: function (e) {
                    var t;
                    e |= 0;
                    a[12 + (t = A - 16 | 0) >> 2] = e;
                    a[a[t + 12 >> 2] + 4 >> 2] = -2;
                    n[a[t + 12 >> 2] + 8 | 0] = 1;
                },
                llparser_descriptor_add_char: function (e, t) {
                    !function (e, t) {
                        var i;
                        a[12 + (i = A - 16 | 0) >> 2] = e;
                        a[i + 8 >> 2] = t;
                        n[a[i + 8 >> 2] + (a[i + 12 >> 2] + 8 | 0) | 0] = 1;
                    }(e |= 0, t |= 0);
                },
                llparser_descriptor_add_range: function (e, t, i) {
                    !function (e, t, i) {
                        var r;
                        a[12 + (r = A - 16 | 0) >> 2] = e;
                        a[r + 8 >> 2] = t;
                        a[r + 4 >> 2] = i;
                        for (a[r >> 2] = a[r + 8 >> 2]; !(a[r >> 2] > a[r + 4 >> 2]);)
                            n[a[r >> 2] + (a[r + 12 >> 2] + 8 | 0) | 0] = 1, a[r >> 2] = a[r >> 2] + 1;
                    }(e |= 0, t |= 0, i |= 0);
                },
                llparser_descriptor_revert: function (e) {
                    !function (e) {
                        var t;
                        a[12 + (t = A - 16 | 0) >> 2] = e;
                        for (a[t + 8 >> 2] = 1; !(a[t + 8 >> 2] >= 127);)
                            n[a[t + 8 >> 2] + (a[t + 12 >> 2] + 8 | 0) | 0] = 1 & (0 != r[a[t + 8 >> 2] + (a[t + 12 >> 2] + 8 | 0) | 0] ^ -1), a[t + 8 >> 2] = a[t + 8 >> 2] + 1;
                    }(e |= 0);
                },
                llparser_add_rule: function (e, t, i, n, a, r, o, s, l, d, A, c) {
                    return 0 | h(e |= 0, t |= 0, i |= 0, n |= 0, a |= 0, r |= 0, o |= 0, s |= 0, l |= 0, d |= 0, A |= 0, c |= 0);
                },
                llparser_prepare: function (e) {
                    !function (e) {
                        var t;
                        A = t = A - 32 | 0;
                        a[t + 28 >> 2] = e;
                        for (a[t + 24 >> 2] = 0; !(a[t + 24 >> 2] >= a[a[t + 28 >> 2] + 4 >> 2]);)
                            a[t + 20 >> 2] = a[a[t + 28 >> 2] + 24 >> 2] + l(a[t + 24 >> 2], 140), 1 == a[a[t + 20 >> 2] + 4 >> 2] && u(a[t + 28 >> 2], a[t + 20 >> 2], a[t + 20 >> 2], a[a[t + 28 >> 2] + 32 >> 2] + (a[t + 24 >> 2] << 9) | 0, 0), a[t + 24 >> 2] = a[t + 24 >> 2] + 1;
                        for (a[t + 16 >> 2] = 0; !(a[t + 16 >> 2] >= a[a[t + 28 >> 2] + 4 >> 2]);)
                            a[t + 12 >> 2] = a[a[t + 28 >> 2] + 24 >> 2] + l(a[t + 16 >> 2], 140), 1 == a[a[t + 12 >> 2] + 4 >> 2] && (a[a[t + 12 >> 2] >> 2] = 0, p(a[t + 28 >> 2], a[t + 12 >> 2], a[t + 12 >> 2], a[a[t + 28 >> 2] + 36 >> 2] + (a[t + 16 >> 2] << 9) | 0)), a[t + 16 >> 2] = a[t + 16 >> 2] + 1;
                        A = t + 32 | 0;
                    }(e |= 0);
                },
                llparser_parse: function (e, t) {
                    return 0 | function (e, t) {
                        var i;
                        var n;
                        var l;
                        A = i = A - 32 | 0;
                        a[i + 24 >> 2] = e;
                        a[i + 20 >> 2] = t;
                        a[i + 16 >> 2] = 0;
                        a[i + 12 >> 2] = 0;
                        n = i;
                        l = function e(t, i, n, l, d, c, h) {
                            var u;
                            var p = 0;
                            var g = 0;
                            A = u = A - 96 | 0;
                            a[u + 88 >> 2] = t;
                            a[u + 84 >> 2] = i;
                            a[u + 80 >> 2] = n;
                            a[u + 76 >> 2] = l;
                            a[u + 72 >> 2] = d;
                            a[u + 68 >> 2] = c;
                            a[u + 64 >> 2] = h;
                            a[u + 60 >> 2] = o[a[u + 80 >> 2] + (a[a[u + 76 >> 2] >> 2] << 1) >> 1];
                            s[u + 60 >> 2] >= 128 && (a[u + 60 >> 2] = 1);
                            e:
                                if (a[a[u + 72 >> 2] >> 2] > (a[u + 64 >> 2] - 4 | 0))
                                    a[u + 92 >> 2] = -1;
                                else if (1 == a[a[u + 84 >> 2] + 4 >> 2])
                                    if (a[u + 56 >> 2] = a[a[u + 76 >> 2] >> 2], a[u + 52 >> 2] = a[a[u + 72 >> 2] >> 2], a[u + 48 >> 2] = 0, a[u + 44 >> 2] = 0, a[u + 40 >> 2] = a[a[u + 88 >> 2] + 32 >> 2] + ((a[u + 84 >> 2] - a[a[u + 88 >> 2] + 24 >> 2] | 0) / 140 << 9), a[u + 36 >> 2] = 0, !a[a[u + 40 >> 2] + (a[u + 60 >> 2] << 2) >> 2] | s[u + 60 >> 2] <= 0 | s[u + 60 >> 2] >= 127 ? !a[u + 60 >> 2] | !a[a[u + 40 >> 2] + 508 >> 2] ? a[a[u + 40 >> 2] >> 2] && (a[u + 36 >> 2] = a[a[u + 40 >> 2] >> 2]) : a[u + 36 >> 2] = a[a[u + 40 >> 2] + 508 >> 2] : a[u + 36 >> 2] = a[a[u + 40 >> 2] + (a[u + 60 >> 2] << 2) >> 2], a[u + 36 >> 2]) {
                                        if (!(a[u + 68 >> 2] || a[a[u + 36 >> 2] + 40 >> 2])) {
                                            a[u + 48 >> 2] = a[a[u + 72 >> 2] >> 2];
                                            t = a[u + 72 >> 2];
                                            a[t >> 2] = a[t >> 2] + 2;
                                        };
                                        for (a[u + 32 >> 2] = 0; a[u + 32 >> 2] < a[a[u + 36 >> 2] + 4 >> 2];) {
                                            a[u + 28 >> 2] = a[u + 68 >> 2];
                                            a[u + 68 >> 2] || !a[a[u + 36 >> 2] + 40 >> 2] | a[a[u + 36 >> 2] + 40 >> 2] == (a[u + 32 >> 2] + 65536 | 0) || (a[u + 28 >> 2] = 1);
                                            p = u;
                                            g = e(a[u + 88 >> 2], a[(a[u + 36 >> 2] + 8 | 0) + (a[u + 32 >> 2] << 2) >> 2], a[u + 80 >> 2], a[u + 76 >> 2], a[u + 72 >> 2], a[u + 28 >> 2], a[u + 64 >> 2]);
                                            a[p + 24 >> 2] = g;
                                            if (a[u + 24 >> 2] < 0) {
                                                a[u + 92 >> 2] = -1;
                                                break e;
                                            }
                                            a[u + 68 >> 2] | a[a[u + 36 >> 2] + 40 >> 2] != (a[u + 32 >> 2] + 65536 | 0) || (a[u + 44 >> 2] = a[u + 24 >> 2]);
                                            a[u + 32 >> 2] = a[u + 32 >> 2] + 1;
                                        }
                                        for (a[u + 68 >> 2] || (a[a[u + 36 >> 2] + 40 >> 2] ? 1 == a[a[u + 36 >> 2] + 40 >> 2] && (i = a[u + 56 >> 2], n = a[a[u + 88 >> 2] + 48 >> 2], l = a[u + 72 >> 2], t = a[l >> 2], a[l >> 2] = t + 1, a[n + (t << 2) >> 2] = i, a[u + 44 >> 2] = a[a[u + 72 >> 2] >> 2], i = a[a[u + 76 >> 2] >> 2], n = a[a[u + 88 >> 2] + 48 >> 2], l = a[u + 72 >> 2], t = a[l >> 2], a[l >> 2] = t + 1, a[n + (t << 2) >> 2] = i) : (a[a[a[u + 88 >> 2] + 48 >> 2] + (a[u + 48 >> 2] << 2) >> 2] = 0 - a[u + 36 >> 2], a[a[a[u + 88 >> 2] + 48 >> 2] + (a[u + 48 >> 2] + 1 << 2) >> 2] = a[a[u + 36 >> 2] + 4 >> 2], a[u + 44 >> 2] = a[u + 48 >> 2] + 1));;) {
                                            if (a[a[u + 72 >> 2] >> 2] > (a[u + 64 >> 2] - 4 | 0)) {
                                                a[u + 92 >> 2] = -1;
                                                break e;
                                            }
                                            a[u + 20 >> 2] = a[a[u + 88 >> 2] + 36 >> 2] + ((a[u + 84 >> 2] - a[a[u + 88 >> 2] + 24 >> 2] | 0) / 140 << 9);
                                            a[u + 16 >> 2] = 0;
                                            a[u + 60 >> 2] = o[a[u + 80 >> 2] + (a[a[u + 76 >> 2] >> 2] << 1) >> 1];
                                            s[u + 60 >> 2] >= 128 && (a[u + 60 >> 2] = 1);
                                            if (!a[a[u + 20 >> 2] + (a[u + 60 >> 2] << 2) >> 2] | s[u + 60 >> 2] <= 0 | s[u + 60 >> 2] >= 127) {
                                                !a[u + 60 >> 2] | !a[a[u + 20 >> 2] + 508 >> 2] || (a[u + 16 >> 2] = a[a[u + 20 >> 2] + 508 >> 2]);
                                            } else {
                                                a[u + 16 >> 2] = a[a[u + 20 >> 2] + (a[u + 60 >> 2] << 2) >> 2];
                                            }
                                            if (!a[u + 16 >> 2])
                                                break;
                                            if (!a[u + 68 >> 2]) {
                                                if (a[a[u + 16 >> 2] + 40 >> 2]) {
                                                    65536 != a[a[u + 16 >> 2] + 40 >> 2] && (a[a[u + 72 >> 2] >> 2] = a[u + 52 >> 2]);
                                                } else {
                                                    a[a[a[u + 88 >> 2] + 48 >> 2] + (a[u + 44 >> 2] << 2) >> 2] = (0 - a[a[a[u + 88 >> 2] + 48 >> 2] + (a[u + 44 >> 2] << 2) >> 2] | 0) - 1;
                                                    a[u + 48 >> 2] = a[a[u + 72 >> 2] >> 2];
                                                    t = a[u + 72 >> 2];
                                                    a[t >> 2] = a[t >> 2] + 2;
                                                }
                                            };
                                            for (a[u + 12 >> 2] = 1; a[u + 12 >> 2] < a[a[u + 16 >> 2] + 4 >> 2];) {
                                                a[u + 8 >> 2] = a[u + 68 >> 2];
                                                a[u + 68 >> 2] || !a[a[u + 16 >> 2] + 40 >> 2] | a[a[u + 16 >> 2] + 40 >> 2] == (a[u + 12 >> 2] + 65536 | 0) || (a[u + 8 >> 2] = 1);
                                                p = u;
                                                g = e(a[u + 88 >> 2], a[(a[u + 16 >> 2] + 8 | 0) + (a[u + 12 >> 2] << 2) >> 2], a[u + 80 >> 2], a[u + 76 >> 2], a[u + 72 >> 2], a[u + 8 >> 2], a[u + 64 >> 2]);
                                                a[p + 4 >> 2] = g;
                                                if (a[u + 4 >> 2] < 0) {
                                                    a[u + 92 >> 2] = -1;
                                                    break e;
                                                }
                                                a[u + 68 >> 2] | a[a[u + 16 >> 2] + 40 >> 2] != (a[u + 12 >> 2] + 65536 | 0) || (a[u + 44 >> 2] = a[u + 4 >> 2]);
                                                a[u + 12 >> 2] = a[u + 12 >> 2] + 1;
                                            }
                                            if (!a[u + 68 >> 2]) {
                                                if (a[a[u + 16 >> 2] + 40 >> 2]) {
                                                    if (1 == a[a[u + 16 >> 2] + 40 >> 2]) {
                                                        i = a[u + 56 >> 2];
                                                        n = a[a[u + 88 >> 2] + 48 >> 2];
                                                        l = a[u + 72 >> 2];
                                                        t = a[l >> 2];
                                                        a[l >> 2] = t + 1;
                                                        a[n + (t << 2) >> 2] = i;
                                                        a[u + 44 >> 2] = a[a[u + 72 >> 2] >> 2];
                                                        i = a[a[u + 76 >> 2] >> 2];
                                                        n = a[a[u + 88 >> 2] + 48 >> 2];
                                                        l = a[u + 72 >> 2];
                                                        t = a[l >> 2];
                                                        a[l >> 2] = t + 1;
                                                        a[n + (t << 2) >> 2] = i;
                                                    };
                                                } else {
                                                    a[a[a[u + 88 >> 2] + 48 >> 2] + (a[u + 48 >> 2] << 2) >> 2] = 0 - a[u + 16 >> 2];
                                                    a[a[a[u + 88 >> 2] + 48 >> 2] + (a[u + 48 >> 2] + 1 << 2) >> 2] = a[a[u + 16 >> 2] + 4 >> 2];
                                                    a[u + 44 >> 2] = a[u + 48 >> 2] + 1;
                                                }
                                            };
                                        }
                                        a[u + 92 >> 2] = a[u + 44 >> 2];
                                    } else
                                        a[u + 92 >> 2] = -1;
                                else {
                                    if (a[u + 60 >> 2] && (-1 == a[a[u + 84 >> 2] + 4 >> 2] && (t = a[u + 76 >> 2], a[t >> 2] = a[t >> 2] + 1), !a[a[u + 84 >> 2] + 4 >> 2])) {
                                        if (!r[a[u + 60 >> 2] + (a[u + 84 >> 2] + 8 | 0) | 0]) {
                                            a[u + 92 >> 2] = -1;
                                            break e;
                                        }
                                        t = a[u + 76 >> 2];
                                        a[t >> 2] = a[t >> 2] + 1;
                                    }
                                    if (!a[u + 68 >> 2]) {
                                        i = a[a[u + 76 >> 2] >> 2];
                                        n = a[a[u + 84 >> 2] + 4 >> 2];
                                        l = a[a[u + 88 >> 2] + 48 >> 2];
                                        d = a[u + 72 >> 2];
                                        t = a[d >> 2];
                                        a[d >> 2] = t + 1;
                                        a[l + (t << 2) >> 2] = i - (-2 == (0 | n) ? 0 : 1);
                                        i = a[a[u + 76 >> 2] >> 2];
                                        n = a[a[u + 88 >> 2] + 48 >> 2];
                                        l = a[u + 72 >> 2];
                                        t = a[l >> 2];
                                        a[l >> 2] = t + 1;
                                        a[n + (t << 2) >> 2] = i;
                                    };
                                    a[u + 92 >> 2] = a[a[u + 72 >> 2] >> 2] - 1;
                                }
                            A = u + 96 | 0;
                            return a[u + 92 >> 2];
                        }(a[i + 24 >> 2], a[i + 20 >> 2], a[a[i + 24 >> 2] + 44 >> 2], i + 12 | 0, i + 16 | 0, 0, a[a[i + 24 >> 2] + 12 >> 2] << 1);
                        a[n + 8 >> 2] = l;
                        e = a[a[i + 24 >> 2] + 48 >> 2];
                        t = a[i + 16 >> 2];
                        a[i + 16 >> 2] = t + 1;
                        a[e + (t << 2) >> 2] = -1;
                        e = a[a[i + 24 >> 2] + 48 >> 2];
                        t = a[i + 16 >> 2];
                        a[i + 16 >> 2] = t + 1;
                        a[e + (t << 2) >> 2] = 0;
                        o[a[a[i + 24 >> 2] + 44 >> 2] + (a[i + 12 >> 2] << 1) >> 1] | a[i + 8 >> 2] < 0 ? a[i + 28 >> 2] = a[i + 12 >> 2] + 1 : a[i + 28 >> 2] = 0;
                        A = i + 32 | 0;
                        return a[i + 28 >> 2];
                    }(e |= 0, t |= 0);
                },
                llparser_get_input_buffer: function (e) {
                    var t;
                    e |= 0;
                    a[12 + (t = A - 16 | 0) >> 2] = e;
                    return a[a[t + 12 >> 2] + 44 >> 2];
                },
                llparser_get_result: function (e) {
                    var t;
                    e |= 0;
                    a[12 + (t = A - 16 | 0) >> 2] = e;
                    return a[a[t + 12 >> 2] + 48 >> 2];
                },
                wasm_main: v,
                __wbindgen_start: v
            };
        }({
            Math: Math,
            Int8Array: Int8Array,
            Uint8Array: Uint8Array,
            Int16Array: Int16Array,
            Uint16Array: Uint16Array,
            Int32Array: Int32Array,
            Uint32Array: Uint32Array,
            Float32Array: Float32Array,
            Float64Array: Float64Array,
            NaN: NaN,
            Infinity: 1 / 0
        }, 0, n);
        var r = a.memory;
        var o = a.rust_calloc;
        var s = a.rust_free;
        var l = a.llparser_create;
        var d = a.llparser_destroy;
        var A = a.llparser_create_descriptor;
        var c = a.llparser_descriptor_set_all;
        var h = a.llparser_descriptor_set_nil;
        var u = a.llparser_descriptor_add_char;
        var p = a.llparser_descriptor_add_range;
        var g = a.llparser_descriptor_revert;
        var _ = a.llparser_add_rule;
        var f = a.llparser_prepare;
        var v = a.llparser_parse;
        var w = a.llparser_get_input_buffer;
        var m = a.llparser_get_result;
        var I = a.wasm_main;
        var b = a.__wbindgen_start;
    }
]);
